A Mismatched Joint Source-Channel Coding Perspective of Probabilistic Amplitude Shaping: Achievable Rates and Error Exponents

نویسنده

  • Rana Ali Amjad
چکیده

Probabilistic Amplitude Shaping (PAS) is a novel method of reliable commmunication over channels with non-uniform capacity achieving input distribution. The encoder of PAS is a concatenation of a distribution matcher with systematic encoding of a Forward Error Correction (FEC) code whereas the PAS decoder is a concatenation of a mismatched FEC decoder and dematcher. In recent works PAS has been shown to close the shaping gap to Shannon capacity for discrete input AWGN channel for a wide range of SNR values. In this paper we modify the classical joint source-channel coding setup to include the salient features of PAS and we derive the Gallager style error exponent and consequently achievable rates for this setup.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiuser Coding Techniques for Mismatched Decoding

This paper studies multiuser coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, error exponents are obtained which are tight with respect to the ensemble average, and positive within the interior of Lapidoth’s achievable rate region. In the special case of maximum-likelihood decoding, the ensembl...

متن کامل

Error Exponents for Joint Source-Channel Coding with Delay-Constraints

Traditionally, joint source-channel coding is viewed in the block coding context — all the source symbols are known in advance by the encoder. Here, we consider source symbols to be revealed to the encoder in real time and require that they be reconstructed at the decoder within a certain fixed end-to-end delay. We derive upper and lower bounds on the reliability function with delay for cases w...

متن کامل

Mismatched Decoding: Finite-Length Bounds, Error Exponents and Approximations

This paper considers the problem of channel coding with a given (possibly suboptimal) decoding rule. Finite-length upper and lower bounds on the random-coding error probability for a general codeword distribution are given. These bounds are applied to three random-coding ensembles: i.i.d., constant-composition, and cost-constrained. Ensembletight error exponents are presented for each ensemble,...

متن کامل

Achievable Rates for Shaped Bit-Metric Decoding

A new achievable rate for bit-metric decoding (BMD) is derived using random coding arguments. The rate expression can be evaluated for any input distribution, and in particular the bit-levels of binary input labels can be stochastically dependent. Probabilistic shaping with dependent bit-levels (shaped BMD), shaping of independent bit-levels (bit-shaped BMD) and uniformly distributed independen...

متن کامل

On Achievable Rates for Channels with Mismatched Decoding

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods: superposition coding and random binning. The inner bounds are derived by analyzing the average error probability of the code ensemble for both methods and by a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1802.05973  شماره 

صفحات  -

تاریخ انتشار 2018